On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
نویسندگان
چکیده
منابع مشابه
Stochastic mathematical programs with equilibrium constraints
In this note, we present the necessary mathematical framework for stochastic MPEC models, including some new results on the existence of solutions and on convexity and diierentiability of the implicit upper-level objective function. In so doing, we clarify the links between these models and two-stage stochastic programs with recourse.
متن کاملSolving Mathematical Programs with Equilibrium Constraints
This paper aims at developing effective numerical methods for solving mathematical programs with equilibrium constraints. Due to the existence of complementarity constraints, the usual constraint qualifications do not hold at any feasible point, and there are various stationarity concepts such as Clarke, Mordukhovich, and strong stationarities that are specially defined for mathematical program...
متن کاملA Note on Smoothing Mathematical Programs with Equilibrium Constraints
Mathematical programs with equilibrium constrains (MPECs) in which the constraints are defined by a parametric variational inequality are considered. Recently, nonlinear programming solvers have been used to solve MPECs. Smoothing algorithms have been very successful. In this note, a smoothing approach based on neural network function to solve MPECs is proposed. The performance of the proposed ...
متن کاملOptimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional subregularity and their characterization by means of objects from generalized differentiation, we obtain the new stationarity concept of extended M-stationarity...
متن کاملGeneralized stationary points and an interior-point method for mathematical programs with equilibrium constraints
Generalized stationary points of the mathematical program with equilibrium constraints (MPEC) are studied to better describe the limit points produced by interior point methods for MPEC. A primal-dual interior-point method is then proposed, which solves a sequence of relaxed barrier problems derived from MPEC. Global convergence results are deduced without assuming strict complementarity or the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2019
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor180915008j